public class Test1 {
    public static int[] searchRange(int[] nums, int target) {
        int[] ret=new int[2];
        ret[0]=ret[1]=-1;
        if(nums.length==0){
            return ret;
        }
        int left=0,right=nums.length-1;
        while(left<right){
            int mid=left+(right-left)/2;
            if(target>nums[mid]){
                left=mid+1;
            }else{
                right=mid;
            }
        }
        if(nums[left]==target){
            ret[0]=left;
        }else{
            return ret;
        }
        left=0;right=nums.length-1;
        while(left<right){
            int mid=left+(right-left+1)/2;
            if(target>=nums[mid]){
                left=mid;
            }else{
                right=mid-1;
            }
        }
        ret[1]=right;
        return ret;
    }
}
